Encryption and Decryption Technique Using Matrix Theory

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Attribute based Encryption and Decryption Technique

Inside a dispersed foriegn atmosphere, anyone receives a untrusted company which has a change for better crucial allowing this foriegn to turn any kind of ABE ciphertext fulfilled through the wearer's features. Stability of ABE technique with outsourced decryption makes certain that a foe (including any destructive cloud) aren't going to be capable to study everything about the encrypted meanin...

متن کامل

A New Polybit Shuffling Encryption and Decryption Algorithm Based on N Dimensional Encryption-Decryption Matrix

This paper elaborates polybit shuffling encryption and decryption algorithm based on N Dimensional encryption-decryption matrix which is an attempt to improve over the Classical Playfair Cipher. The unique feature of this algorithm is that it retains the simplicity of Classical Playfair Cipher but increases the robustness against crypto-attack by many folds. Moreover this algorithm can be used ...

متن کامل

Encryption-decryption Rgb Color Image Using Matrix Multiplication

An enhanced technique of color image encryption based on random matrix key encoding is proposed. To encrypt the color image a separation into Red Green and Blue (R, G, B) channels will applied. Each channel is encrypted using a technique called double random matrix key encoding then three new coding image matrices are constructed. To obtain the reconstructed image that is the same as the origin...

متن کامل

Data Encryption and Decryption Using ANZL Algorithm

What is the ANZL Algorithm? It is a genuine result of our work which is theoretically and practically proved. By using the ANZL Algorithm, we can test whether a given number belongs to Lucas’s series. It can also be used to find a sequence of Lucas’s numbers, starting from any number . If a given number completes the relation , we can say that it is a Lucas number and we mark it as . From the p...

متن کامل

Eliminating Decryption Failures from the Simple Matrix Encryption Scheme

The SimpleMatrix encryption scheme as proposed by Tao et al. [16] is one of the very few existing approaches to create a secure and efficient encryption scheme on the basis of multivariate polynomials. However, in its basic version, decryption failures occur with non-negligible probability. Although this problem has been addressed in several papers [5,17], a general solution to it is still miss...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Computational Mathematica

سال: 2019

ISSN: 2456-8686

DOI: 10.26524/cm49